Dirichlet Prime Number Theorem

نویسنده

  • JING MIAO
چکیده

In number theory, the prime number theory describes the asymptotic distribution of prime numbers. We all know that there are infinitely many primes,but how are they distributed? Dirichlet’s theorem states that for any two positive coprime integers a and d, there are infinitely many primes which are congruent to a modulo d. A stronger form of Dirichlet’s theorem states that the sum of the reciprocals of the prime numbers with the same modulo diverges, and different progressions with the same modulus have approximately the same proportions of primes. We will walk through the proofs of Dirichlet’s theorem, and introduce some related topics, such as the Riemann-zeta function and quadratic field.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Math 254a: Zeta Functions and L-series

Theorem 1.1. Let G be a group of Dirichlet characters modulo n, and KG the associated field. Fix a prime number p, and let H1 ⊂ H2 ⊂ G be the groups of χ such that χ(p) = 1 or χ(p) 6= 0 respectively. Then G/H2 ∼= IKG,p ⊂ Gal(KG/Q), and G/H1 ∼= DKG,p (note that these are non-canonical isomorphisms). We are now ready to prove the theorem on factoring Dedekind zeta functions of sub-cyclotomic fiel...

متن کامل

Finite Fourier Analysis and Dirichlet’s Theorem

This is an expository paper on finite Fourier analysis and basic number theory. The focus of the paper is finite Abelian groups and the properties of these groups which are used in the proof of the Dirichlet prime number theorem. We then introduce the specific elements and basic structure of the proof of Dirichlet’s theorem.

متن کامل

Elementary Number Theory

Forward We start with the set of natural numbers, N = {1, 2, 3, . . .} equipped with the familiar addition and multiplication and assume that it satisfies the induction axiom. It allows us to establish division with a residue and the Euclid’s algorithm that computes the greatest commond divisor of two natural numbers. It also leads to a proof of the fundamental theorem of arithmetic: Every natu...

متن کامل

Notes on Primes in Arithmetic Progression

The following is a quick set of notes of some properties of Dirichlet characters, in particular, how they are used to prove the infinitude of primes in arithmetic progressions. These notes are from from An Invitation to Modern Number Theory, by myself and Ramin Takloo-Bighash. As this is a modified snippet from the book, references to other parts of the book are displayed as ??. 1. Dirichlet Ch...

متن کامل

Lectures on Analytic Number Theory

1. What is Analytic Number Theory? 2 1.1. Generating functions 2 1.2. Operations on series 3 1.3. Some interesting series 5 2. The Zeta Function 6 2.1. Some elementary number theory 6 2.2. The infinitude of primes 7 2.3. Infinite products 7 2.4. The zeta function and Euler product 7 2.5. Infinitude of primes of the form 4k + 1 8 3. Dirichlet characters and L functions 9 3.1. Dirichlet character...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013